Sparse regular random graphs: Spectral density and eigenvectors
نویسندگان
چکیده
منابع مشابه
Sparse Regular Random Graphs: Spectral Density and Eigenvectors
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of vertices, the empirical spectral distribution converges to the semicircle law. Moreover, we prove concentration estimates on the number of eigenvalues over progressi...
متن کاملSparse random graphs: Eigenvalues and eigenvectors
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdős-Rényi random graph G(n, p), answering a question raised by Dekel-Lee-Linial.
متن کاملRegular pairs in sparse random graphs I
We consider bipartite subgraphs of sparse random graphs that are regular in the sense of Szemerédi and, among other things, show that they must satisfy a certain local pseudorandom property. This property and its consequences turn out to be useful when considering embedding problems in subgraphs of sparse random graphs.
متن کاملEmpirical Spectral Distributions of Sparse Random Graphs
We study the spectrum of a random multigraph with a degree sequence Dn = (Di) n i=1 and average degree 1 ωn n, generated by the configuration model. We show that, when the empirical spectral distribution (esd) of ω−1 n Dn converges weakly to a limit ν, under mild moment assumptions (e.g., Di/ωn are i.i.d. with a finite second moment), the esd of the normalized adjacency matrix converges in prob...
متن کاملSpectral techniques applied to sparse random graphs
We analyze the eigenvalue gap for the adjacency matrices of sparse random graphs. Let λ1 ≥ . . . ≥ λn be the eigenvalues of an n-vertex graph, and let λ = max[λ2, |λn|]. Let c be a large enough constant. For graphs of average degree d = c log n it is well known that λ1 ≥ d, and we show that λ = O( √ d). For d = c it is no longer true that λ = O( √ d), but we show that by removing a small number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2012
ISSN: 0091-1798
DOI: 10.1214/11-aop673